On stochastic languages

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

R70-3 On Stochastic Languages

Although considerable progress has been made in the understanding of the more "algebraic" properties of context-free languages, the quantitative aspects of the recognition and parsing of contextfree languages are still far from well understood. It was shown by Kasami and Younger that for every context-free language there exists a multitape Turing machine which recognizes this language and uses ...

متن کامل

Stochastic Languages and Stochastic Grammars

Two types of stochastic grammars are introduced for investigation: the (classical) unrestricted stoch-astic grammars and the (newly introduced) weakly restricted stochastic grammars. Especially consistency and conditions for it will be treated. The theory of multitype Galton-Watson branching processes and generating functions is of central importance to nd criteria for consistency. We will prov...

متن کامل

On the unary equivalence of stochastic languages and stochastic context-free languages

We show that every unary stochastic context-free grammar with polynomially bounded ambiguity, has an equivalent probabilistic automaton.

متن کامل

Rational stochastic languages

The goal of the present paper is to provide a systematic and comprehensive study of rational stochastic languages over a semiring K ∈ {Q,Q,R,R}. A rational stochastic language is a probability distribution over a free monoid Σ which is rational over K, that is which can be generated by a multiplicity automata with parameters in K. We study the relations between the classes of rational stochasti...

متن کامل

Learning Rational Stochastic Languages

Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference is to infer an estimate of P in some class of probabilistic models, such as Probabilistic Automata (PA). Here, we study the class S R (Σ) of rational stochastic languages, which consists in stochastic languages that c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Control

سال: 1968

ISSN: 0019-9958

DOI: 10.1016/s0019-9958(68)90360-4